Bounding completion times of jobs with arbitrary release times, variable execution times and resource sharing
نویسندگان
چکیده
منابع مشابه
Bounding Completion Times of Jobs with Arbitrary Release Times, Variable Execution Times and Resource Sharing
| The workload of many real-time systems can be characterized as a set of preemptable jobs with linear precedence constraints. Typically their execution times are only known to lie within a range of values. In addition jobs share resources and access to the resources must be synchronized to ensure the integrity of the system. This paper is concerned with the schedulability of such jobs when sch...
متن کاملBounding completion times of jobs with arbitrary release times and variable execution times
In many real-time systems, the workload can be characterized as a set of jobs with linear precedence constraints among them. Jobs often have variable execution times and arbitrary release times. We describe here three algorithms that can be used to compute upper bounds on completion times of such jobs scheduled on a priority-driven basis. The algorithmshave different performance and complexity....
متن کاملAn NC Algorithm for Scheduling Unit-Time Jobs With Arbitrary Release Times and Deadlines
The problem of scheduling n unit-time jobs with real-valued release times and deadlines is shown to be in NC. The solution is based on characterizations of a canonical schedule and best subset of jobs to be scheduled in a given time interval. The algorithm runs in O((logn)2) time and uses O(n'ljlogn) processors.
متن کاملList scheduling for jobs with arbitrary release times and similar lengths
This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time and length in [1, r] with r ≥ 1 on m parallel identical machines. For the list scheduling algorithm, we give an upper bound of the competitive ratio for any m ≥ 1 and show that the upper bound is tight when m= 1. When m= 2, we present a tight bound for r ≥ 4. For r <...
متن کاملSemi-online scheduling for jobs with release times
In this paper we consider three semi-online scheduling problems for jobs with release times on m identical parallel machines. The worst case performance ratios of the LS algorithm are analyzed. The objective function is to minimize the maximum completion time of all machines, i.e. the makespan. If the job list has a nondecreasing release times, then 2− 1 m is the tight bound of the worst case p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Software Engineering
سال: 1997
ISSN: 0098-5589
DOI: 10.1109/32.637144